Alcove Paths and Gelfand–Tsetlin Patterns

نویسندگان

چکیده

In their study of the equivariant K-theory generalized flag varieties G/P, where G is a complex semisimple Lie group, and P parabolic subgroup G, Lenart Postnikov introduced combinatorial tool, called alcove path model. It provides model for highest weight crystals with dominant integral weights, generalizing by semistandard Young tableaux. this paper, we prove simple explicit formula describing crystal isomorphism between Gelfand–Tsetlin pattern type A.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian Paths and Hyperbolic Patterns

In 1978 I thought it would be possible to design a computer algorithm to draw repeating hyperbolic patterns in a Poincaré disk based on Hamiltonian paths in their symmetry groups. The resulting successful program was capable of reproducing each of M.C. Escher’s four “Circle Limit” patterns. The program could draw a few other patterns too, but was somewhat limited. Over the years I have collabor...

متن کامل

Paths Into Patterns

The XML Path Language (XPATH) is an industry standard notation for addressing parts of an XML document. It is supported by many XML processing libraries and has been used as the foundation for several dedicated XML processing languages. Regular patterns, an alternative way of investigating and destructing XML documents, were first proposed in the XDUCE language and feature in a number of its de...

متن کامل

Matchings Avoiding Partial Patterns and Lattice Paths

In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (0, 2) to (2n, 0). As a consequence, the refined enumeration of 1123-avoiding matchings can be reduced to the enumeration of certain lattice paths. Another result of this paper is a bijection between 1132-avoiding match...

متن کامل

Permutations with Restricted Patterns and Dyck Paths

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12 . . . k follow directly from old results on the enumeration of Motzkin paths, among which is a continued fraction result due to Flajolet. As a...

متن کامل

Alcove walks, buildings, symmetric functions and representations

For a complex simple Lie algebra g, the dimension Kλμ of the μ weight space of a finite dimensional representation of highest weight λ is the same as the number of Littelmann paths of type λ and weight μ. In this paper we give an explicit construction of a path of type λ and weight μ whenever Kλμ 6= 0. This construction has additional consequences, it produces an explicit point in the building ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Combinatorics

سال: 2021

ISSN: ['0219-3094', '0218-0006']

DOI: https://doi.org/10.1007/s00026-021-00544-5